SAT-based Minimization of Deterministic ω-Automata
نویسندگان
چکیده
We describe a tool that inputs a deterministic ω-automaton with any acceptance condition, and synthesizes an equivalent ω-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal ω-automata equivalent to given properties, for different acceptance conditions.
منابع مشابه
Efficient minimization of deterministic weak ω-automata
We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n · logn), where n is the number of states of...
متن کاملLearn with SAT to Minimize Büchi Automata
We describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton Amin with the minimal number of states is learned with the help of a SATsolver. This is done by successively computing automata A′ that approximate A in the sense that they accept a given finite set of positive examples and reject a given finite set of negative examples. In the c...
متن کاملMinimising Deterministic Büchi Automata Precisely Using SAT Solving
We show how deterministic Büchi automata can be fully minimised by reduction to the satisfiability (SAT) problem, yielding the first automated method for this task. Size reduction of such ω-automata is an important step in probabilistic model checking as well as synthesis of finite-state systems. Our experiments demonstrate that state-of-theart SAT solvers are capable of solving the resulting s...
متن کاملMinimization and Learning in the class DWBA
In this paper, we give a characterization based on Nerode’s right congruence of DWBA which is the subclass of ω-regular languages which are recognized by a deterministic weak Büchi automaton (DWBA). Thanks to that we can define a partial minimization of deterministic Büchi automata (DBA) and explain the DWBA minimization due to Löding [Löd01]. We have also explain in a different manner the Lear...
متن کاملAlternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version)
We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic, typically LTL. The basis of BMC consists on encoding the existence of a counterexample trace of bounded de...
متن کامل